Computer Aided Melodic Analysis using Suffix Tree
نویسندگان
چکیده
Authors LINEARISE the music score in Midi or MusicXml format to obtain individual voices; TRANSFORM subsequent note pairs to characters from the alphabet describing pitch difference and rhythmical ratio; GENERATE all string suffixes and put them into a suffix tree; EVALUATE all samples based on their length, frequency in the score and melodical/rhythmical diversity based on normalized entropy between the notes in the melody. ⇒ IDENTIFY AND REPORT the most significant samples. Approach
منابع مشابه
A System for Computer Music Generation by Learning and Improvisation in a Particular Style
The paper deals with question of music modeling and generation, capturing the idiomatic style of a composer or a genre, in an attempt to provide the computer with “creative”, human-like capabilities. The system described in the paper performs analyses of musical sequences and computes a model according to which new interpretations / improvisations close to the original's style can be generated....
متن کاملDIAGNOSIS OF BREAST LESIONS USING THE LOCAL CHAN-VESE MODEL, HIERARCHICAL FUZZY PARTITIONING AND FUZZY DECISION TREE INDUCTION
Breast cancer is one of the leading causes of death among women. Mammography remains today the best technology to detect breast cancer, early and efficiently, to distinguish between benign and malignant diseases. Several techniques in image processing and analysis have been developed to address this problem. In this paper, we propose a new solution to the problem of computer aided detection and...
متن کاملERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings
The suffix tree is a data structure for indexing strings. It is used in a variety of applications such as bioinformatics, time series analysis, clustering, text editing and data compression. However, when the string and the resulting suffix tree are too large to fit into the main memory, most existing construction algorithms become very inefficient. This paper presents a disk-based suffix tree ...
متن کاملERA Revisited: Theoretical and Experimental Evaluation
Efficient construction of the suffix tree given an input text is an active area of research from the time it was first introduced. Both theoretical computer scientists and engineers tackled the problem. In this paper we focus on the fastest practical suffix tree construction algorithm to date, ERA. We first provide a theoretical analysis of the algorithm assuming the uniformly random text as an...
متن کاملCompact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth
Suffix trees are the most frequently used data structures in algorithms on words. In this paper, we consider the depth of a compact suffix tree, also known as the PAT tree, under some simple probabilistic assumptions. For a biased memoryless source, we prove that the limiting distribution for the depth in a PAT tree is the same as the limiting distribution for the depth in a PATRICIA trie, even...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012